Block-Diagonal and LT Codes for Distributed Computing With Straggling Servers
نویسندگان
چکیده
منابع مشابه
Block-Diagonal and LT Codes for Distributed Computing With Straggling Servers
We propose two coded schemes for the distributed computing problem of multiplying a matrix by a set of vectors. The first scheme is based on partitioning the matrix into submatrices and applying maximum distance separable (MDS) codes to each submatrix. For this scheme, we prove that up to a given number of partitions the communication load and the computational delay (not including the encoding...
متن کاملDistributed LT Codes with Unequal Error Protection
In this paper, we present a method to provide unequal error protection (UEP) for distributed sources in a two-source single-sink relay network scenario. A simple yet efficient technique to decompose the Robust Soliton Distribution (RSD) into two entirely different distributions by utilizing the concept of deconvolution is presented and these two different distributions are used at two different...
متن کاملOn the Performance of Distributed LT Codes
In this paper we extend previous results on distributed LT codes and focus on the frame erasure rate performance of the corresponding block codes with fixed rate. Specifically, we address modified LT (MLT) codes which resemble LT codes in both structure and performance. First, an MLT code construction scheme for four sources communicating with a single sink via a common relay is presented. Then...
متن کاملLT Codes For Efficient and Reliable Distributed Storage Systems Revisited
LT codes and digital fountain techniques have received significant attention from both academics and industry in the past few years. There have also been extensive interests in applying LT code techniques to distributed storage systems such as cloud data storage in recent years. However, Plank and Thomason’s experimental results show that LDPC code performs well only asymptotically when the num...
متن کاملDiagonal algebraic space-time block codes
We construct a new family of linear space-time block codes by the combination of rotated constellations and the Hadamard transform, and we prove them to achieve the full transmit diversity over a quasi-static or fast fading channels. The proposed codes transmit at a normalized rate of 1 symbol/sec. When the number of transmit antennae n = 1, 2 or n is a multiple of 4 we spread a rotated version...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2019
ISSN: 0090-6778,1558-0857
DOI: 10.1109/tcomm.2018.2877391